Average Throughput with Linear Network Coding over Finite Fields: The Combination Network Case
نویسندگان
چکیده
Recommended by Andrej Stefanov We characterize the average linear network coding throughput, T avg c , for the combination network with min-cut 2 over an arbitrary finite field. We also provide a network code, completely specified by the field size, achieving T avg c for the combination network.
منابع مشابه
Network Coding in Planar Networks
A basic problem in network coding is to choose a field to perform the encoding and decoding operations in. The main message we wish to deliver in this talk is that while unboundedly large fields are required in arbitrary networks, very small finite fields may be sufficient for networks in practice. We use planar networks as a representative example of a practical network, which usually has a li...
متن کاملLinear Network Coding Over Rings - Part II: Vector Codes and Non-Commutative Alphabets
In Part I, we studied linear network coding over finite commutative rings and made comparisons to the wellstudied case of linear network coding over finite fields. Here, we consider the more general setting of linear network coding over finite (possibly non-commutative) rings and modules. We prove the following results regarding the linear solvability of directed acyclic networks over various f...
متن کاملBroadcast Throughput in Radio Networks: Routing vs. Network Coding
The broadcast throughput in a network is defined as the average number of messages that can be transmitted per unit time from a given source to all other nodes when time goes to infinity. Classical broadcast algorithms treat messages as atomic tokens and route them from the source to the receivers by making intermediate nodes store and forward messages. The more recent network coding approach, ...
متن کاملDecoding Algorithms for Random Linear Network Codes
We consider the problem of efficient decoding of a random linear code over a finite field. In particular we are interested in the case where the code is random, relatively sparse, and use the binary finite field as an example. The goal is to decode the data using fewer operations to potentially achieve a high coding throughput, and reduce energy consumption. We use an on-the-fly version of the ...
متن کاملOn Network Coding for Communicating the Sum of Symbols from Multiple Sources
In this thesis, we consider a communication problem over a directed acyclic network of unit capacity links having m sources and n terminals, where each terminal requires the sum of symbols generated at all the sources. We assume that each source generates one i.i.d. random process with uniform distribution over a finite alphabet having an abelian group structure, and the different source proces...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- EURASIP J. Wireless Comm. and Networking
دوره 2008 شماره
صفحات -
تاریخ انتشار 2008